Two-way automata with more than one storage mediumVOGEL, J; WAGNER, K.Theoretical computer science. 1985, Vol 39, Num 2-3, pp 267-280, issn 0304-3975Article

Qualitative relativizations of complexity classesBOOK, R. V; LONG, T. J; SELMAN, A. L et al.Journal of computer and system sciences (Print). 1985, Vol 30, Num 3, pp 395-413, issn 0022-0000Article

Universal quantifiers and time complexity of random access machinesGRANDJEAN, E.Mathematical systems theory. 1985, Vol 18, Num 2, pp 171-187, issn 0025-5661Article

Fooling a two-way nondeterministic multihead automaton with reversal number restrictionHROMKOVIC, J.Acta informatica. 1985, Vol 22, Num 5, pp 589-594, issn 0001-5903Article

Alternating one-way multihead turing machines with only universal statesSAKURAYAMA, S; MATSUNO, H; INOUE, K et al.Transactions of the Institute of Electronics and Communication Engineers of Japan. Section E. 1985, Vol 68, Num 10, pp 705-711, issn 0387-236XArticle

Lower Bounds for Complementation of ω-Automata Via the Full Automata TechniqueQIQI YAN.Lecture notes in computer science. 2006, pp 589-600, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Algorithms for computing small NFAsILIE, Lucian; SHENG YU.Lecture notes in computer science. 2002, pp 328-340, issn 0302-9743, isbn 3-540-44040-2, 13 p.Conference Paper

Note on the succinctness of deterministic, nondeterministic, probabilistic and quantum finite automataMEREGHETTI, Carlo; PALANO, Beatrice; PIGHIZZINI, Giovanni et al.Theoretical informatics and applications. 2001, Vol 35, Num 5, pp 477-490Article

Module checking revisitedKUPFERMAN, O; VARDI, M. Y.Lecture notes in computer science. 1997, pp 36-47, issn 0302-9743, isbn 3-540-63166-6Conference Paper

NFA to DFA transformation for finite languagesSALOMAA, K; YU, S.Lecture notes in computer science. 1997, pp 149-158, issn 0302-9743, isbn 3-540-63174-7Conference Paper

Simulating alternating tree automata by nondeterministic automata : new results and new proffs of the theorems of Rabin, McNaughton and SafraMULLER, D. E; SCHUPP, P. E.Theoretical computer science. 1995, Vol 141, Num 1-2, pp 69-107, issn 0304-3975Article

Reversal ― bounded nondeterministic multicounter machines and complementationHROMKOVIC, J.Theoretical computer science. 1987, Vol 51, Num 3, pp 325-330, issn 0304-3975Article

Sue une logique programmée non déterministeMUSIKAEV, I. KH.Sibirskij matematičeskij žurnal. 1986, Vol 27, Num 6, pp 157-162, issn 0037-4474Article

Nondeterministic tree automataNIESSNER, Frank.Lecture notes in computer science. 2002, pp 135-152, issn 0302-9743, isbn 3-540-00388-6, 18 p.Conference Paper

New finite automaton constructions based on canonical derivativesCHAMPARNAUD, Jean-Marc; ZIADI, D.Lecture notes in computer science. 2001, pp 94-104, issn 0302-9743, isbn 3-540-42491-1Conference Paper

On the complexity of parity word automataKING, Valerie; KUPFERMAN, Orna; VARDI, Moshe Y et al.Lecture notes in computer science. 2001, pp 276-286, issn 0302-9743, isbn 3-540-41864-4Conference Paper

Abstract and-parallel machinesDERSHOWITZ, N; LINDENSTRAUSS, N.Lecture notes in computer science. 1997, pp 1221-1225, issn 0302-9743, isbn 3-540-63440-1Conference Paper

Dynamical implementation of nondeterministic automata and concurrent systemsGARZON, M; EBERBACH, E.Lecture notes in computer science. 1997, pp 35-49, issn 0302-9743, isbn 3-540-63174-7Conference Paper

Instruction computation in subset constructionJOHNSON, J. H; WOOD, D.Lecture notes in computer science. 1997, pp 64-71, issn 0302-9743, isbn 3-540-63174-7Conference Paper

Preset two-head automata and morphological analysis of natural languageCREIDER, C; HANKAMER, J; WOOD, D et al.International journal of computer mathematics. 1995, Vol 58, Num 1-2, pp 1-18, issn 0020-7160Article

Nondeterministic bounded quercy reducibilitiesBEIGEL, R; GASARCH, W; OWINGS, J et al.Annals of pure and applied logic. 1989, Vol 41, Num 2, pp 107-118, issn 0168-0072Article

Tree-walking automata cannot be determinizedBOJANCZYK, Mikolaj; COLCOMBET, Thomas.Lecture notes in computer science. 2004, pp 246-256, issn 0302-9743, isbn 3-540-22849-7, 11 p.Conference Paper

Determinization of Büchi-automataROGGENBACH, Markus.Lecture notes in computer science. 2002, pp 43-60, issn 0302-9743, isbn 3-540-00388-6, 18 p.Conference Paper

Supernondeterministic finite automataVAN ZIJL, Lynette.Lecture notes in computer science. 2002, pp 274-288, issn 0302-9743, isbn 3-540-00400-9, 15 p.Conference Paper

Note on minimal finite automataJIRASKOVA, Galina.Lecture notes in computer science. 2001, pp 421-431, issn 0302-9743, isbn 3-540-42496-2Conference Paper